Conflict and conflict-free theories

Conflict-free Covering

Let P = {C1, C2, . . . , Cn} be a set of color classes, where each color class Ci consists of a set of points. In this paper, we address a family of covering problems, in which one is allowed to cover at most one point from each color class. We prove that the problems in this family are NP-complete (or NP-hard) and offer several constant-factor approximation algorithms.

Conflict-free Colorings

Motivated by a frequency assignment problem in cellular telephone networks, Even et al. studied the following question. Given a set P of n points in general position in the plane, what is the smallest number of colors in a coloring of the elements of P with the property that any closed disk D with D ∩ P 6= ∅ has an element whose color is not assigned to any other element of D ∩ P . We refer to ...

Conflict Theories and Social Work Education

Conflict and Conflict Management

Conflict cannot be avoided since it is an inevitable aspect of work teams. Conflict may be defined as a struggle or contest between people with opposing needs, ideas, beliefs, values, or goals. Conflict on teams is inevitable; however, the results of conflict are not predetermined. Conflict might escalate and lead to nonproductive results, or conflict can be beneficially resolved and lead to qu...

Conflict-Free Replicated Data Types

Replicating data under Eventual Consistency (EC) allows any replica to accept updates without remote synchronisation. This ensures performance and scalability in largescale distributed systems (e.g., clouds). However, published EC approaches are ad-hoc and error-prone. Under a formal Strong Eventual Consistency (SEC) model, we study sufficient conditions for convergence. A data type that satisf...